Continuous - Time Frequency Domain Subspace System Identi cation 1
نویسندگان
چکیده
In this paper we present a new subspace identi cation algorithm for the identi cation of multiinput multi-output linear time-invariant continuous-time systems from measured frequency response data. We show how the conditioning of the data-matrices in the algorithm can be improved by making use of recursions derived from the Forsythe polynomials. The asymptotic properties are analyzed and it is shown that, when the error distribution on the measurements is given, the algorithm can be made asymptotically unbiased through the introduction of a weighting matrix.
منابع مشابه
Frequency Domain System Identi cation with IVBased Subspace
In this paper we discuss how the time domain subspace based iden-tiication algorithms can be modiied in order to be applicable when the primary measurements are given as samples of the Fourier transform of the input and output signals. Particularly we study the PI-MOESP algorithm 19] in a frequency domain framework. We show that this method is consistent if a certain rank constraint is satissed...
متن کاملAbout the Choice of State Space Basis in Combined Deterministic-stochastic Subspace Identiication 1 Technology and Culture. the Scientiic Responsibility Rests with Its Authors
This paper describes how the state space basis of models identi ed with subspace identi cation algorithms can be determined. It is shown that this basis is determined by the input spectrum and by user de ned input and output weightings. Through the connections between subspace identi cation and frequency weighted balancing, the state space basis of the subspace identi ed models is shown to coin...
متن کاملIdentiication in H 1 with Nonuniformly Spaced Frequency Response Measurements
In this paper, the problem of \system identi cation in H 1 " is investigated in the case when the given frequency response data is not necessarily on a uniformly spaced grid of frequencies. A large class of robustly convergent identi cation algorithms are derived. A particular algorithm is further examined and explicit worst case error bounds (in the H 1 norm) are derived for both discrete-time...
متن کاملFrequency domain versus time domain methods in system identification
For some reason I now forget, Keith Glover and I were asked to prepare a discussion paper on frequency and time domain methods in system identi cation by the organizers of the IFAC symposium on System Identi cation in Darmstadt 1979. I visited Keith in Cambridge in April 1979 to prepare our paper. It later evolved into an Automatica arcticle. Since then, there has been a useful development of s...
متن کاملSubspace state space system identi®cation for industrial processes
We give a general overview of the state-of-the-art in subspace system identi®cation methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basics of linear subspace identi®cation are summarized. Dierent algorithms one ®nds in literature (such as N4SID, IV-4SID, MOESP, CVA) are discussed and put into a unify...
متن کامل